The graphs with maximum induced matching and maximum matching the same size
نویسندگان
چکیده
منابع مشابه
Maximum matching on random graphs
– The maximum matching problem on random graphs is studied analytically by the cavity method of statistical physics. When the average vertex degree c is larger than 2.7183, groups of max-matching patterns which differ greatly from each other gradually emerge. An analytical expression for the max-matching size is also obtained, which agrees well with computer simulations. Discussion is made on t...
متن کاملStability of the Maximum Size Matching
Among scheduling algorithms used in input queued switches, it is known that the Maximum Size Matching (MSM) algorithm maximizes the instantaneous throughput. Although there have been results on the stability of some specific types of MSMs for scheduling traffic [5], the question of how it performs under uniform traffic remains open. Simulations suggest the stability of MSM algorithms under unif...
متن کاملMaximum Induced Matching on Regular Graphs and Trees
We investigate the complexity of the Maximum Induced Matching problem on regular graphs and trees. The problem is shown to be NP-complete on regular graphs of degree 4s for any positive integer s. We also looks at very simple approximation algorithms: we show that the largest induced matching in a regular graph of degree d can be approximated with a performance ratio less than d. However a simp...
متن کاملThe Maximum Partition Matching
Let S = fC 1 ; C 2 ; : : :; C k g be a collection of pairwise disjoint subsets of U = f1; 2; : : :; ng such that S k i=1 C i = U. A partition matching of S consists of two subsets fa 1 ; a 2 ; : : :; a m g and fb 1 ; b 2 ; : : :; b m g of U together with a sequence of distinct partitions of) such that a i is contained in a subset in the collection A i and b i is contained in a subset in the col...
متن کاملMaximum induced matching problem on hhd-free graphs
An induced matching in a graph is a set of edges such that no two edges in the set are joined by any third edge of the graph. An induced matching is maximum (MIM) if the number of edges in it is the largest among all possible induced matchings. It is known that finding the size of a MIM in a graph is NP-hard even if the graph is bipartite. It is also known that the size of a MIM in a chordal gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2005
ISSN: 0012-365X
DOI: 10.1016/j.disc.2004.07.022